Kolmogorov complexity and degrees of tally sets
نویسندگان
چکیده
منابع مشابه
Kolmogorov-Loveland Sets and Advice Complexity Classes
Loveland complexity Loveland (1969) is a variant of Kolmogorov complexity, where it is asked to output separately the bits of the desired string, instead of the string itself. Similarly to the resource-bounded Kolmogorov sets we define Loveland sets. We highlight a structural connection between resource-bounded Loveland sets and some advice complexity classes. This structural connection enables...
متن کاملKolmogorov complexity and computably enumerable sets
We study the computably enumerable sets in terms of the: (a) Kolmogorov complexity of their initial segments; (b) Kolmogorov complexity of finite programs when they are used as oracles. We present an extended discussion of the existing research on this topic, along with recent developments and open problems. Besides this survey, our main original result is the following characterization of the ...
متن کاملKolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
We study in which way Kolmogorov complexity and instance complexity affect properties of r.e. sets. We show that the well-known 2 log n upper bound on the Kolmogorov complexity of initial segments of r.e. sets is optimal and characterize the T-degrees of r.e. sets which attain this bound. The main part of the paper is concerned with instance complexity of r.e. sets. We construct a nonrecursive ...
متن کاملNL-printable sets and nondeterministic Kolmogorov complexity
P-printable sets were defined by Hartmanis and Yesha and have been investigated by several researchers. The analogous notion of Lprintable sets was defined by Fortnow et al; both P-printability and L-printability were shown to be related to notions of resource-bounded Kolmogorov complexity. NL-printability was defined by Jenner and Kirsig, but some basic questions regarding this notion were lef...
متن کاملOn Kolmogorov Complexity of Hard Sets
There are two main informal ideas related to informational content of hard sets. The first says that a set of low informational content can not be hard or complete for a great enough complexity class because of lack of information accessible with bounded resources. One of the formalization of this idea is well-known Hartmanis Conjecture: Sparse sets are not Ccomplete if C is great enough comple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1990
ISSN: 0890-5401
DOI: 10.1016/0890-5401(90)90052-j